Deterministic automaton

Results: 176



#Item
81Büchi automaton / Finite-state machine / Deterministic automaton / Muller automaton / Automata theory / Theoretical computer science / Computer science

Unambiguous Finite Automata ¨ Christof Loding Department of Computer Science RWTH Aachen University, Germany

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2013-06-27 09:04:03
82Graph / Deterministic pushdown automaton / Nested word / Graph theory / Mathematics / Theoretical computer science

INFINITE GRAPHS GENERATED BY TREE REWRITING Von der Fakult¨at f¨ ur Mathematik, Informatik und Naturwissenschaften der Rheinisch-Westf¨alischen Technischen

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2012-05-29 10:55:56
83Mathematics / Binary decision diagram / Tree automaton / Nondeterministic finite automaton / Deterministic finite automaton / Tree traversal / Binary tree / Tree / Infinite tree automaton / Automata theory / Theoretical computer science / Computer science

Algorithms for Guided Tree Automata Morten Biehl1 , Nils Klarlund2 , and Theis Rauhe1 1 BRICS, Department of Computer Science, University of Aarhus,

Add to Reading List

Source URL: www.brics.dk

Language: English - Date: 2007-03-08 16:46:59
84Ω-automaton / Muller automaton / Alternating tree automata / Tree automaton / Alternating finite automaton / Nondeterministic finite automaton / Deterministic automaton / Finite-state machine / Parity game / Automata theory / Theoretical computer science / Computer science

Automata on Inifinite Trees Christof L¨oding Lehrstuhl Informatik 7 RWTH Aachen[removed]Aachen, Germany email: [removed]

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2012-05-29 10:55:51
85Formal languages / Computer science / Deterministic pushdown automaton / SC / Finite-state machine / Alphabet / Ordinal number / Nested word / Automata theory / Theoretical computer science / Models of computation

Decision Problems for Deterministic Pushdown Automata on Infinite Words ¨ Christof Loding RWTH Aachen University, Germany

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2014-07-22 06:08:02
86Theoretical computer science / Mathematics / Formal languages / National Parliamentary Debate Association / Pushdown automaton / Deterministic pushdown automaton / Alphabet / Algorithm / Turing machine / Theory of computation / Models of computation / Automata theory

Using Hands-On Visualizations to Teach Computer Science from Beginning Courses to Advanced Courses Susan H. Rodger∗ Department of Computer Science Duke University Durham, NC 27705

Add to Reading List

Source URL: www.cs.duke.edu

Language: English - Date: 2002-06-14 13:50:50
87Complexity classes / Applied mathematics / Nondeterministic finite automaton / Deterministic finite automaton / Lookahead / PSPACE-complete / NP / Theoretical computer science / Automata theory / Models of computation

Decidability Results on the Existence of Lookahead Delegators for NFA Christof Löding and Stefan Repke Lehrstuhl für Informatik 7, RWTH Aachen, Aachen, Germany Abstract

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2014-02-07 10:22:52
88Computing / Nondeterministic finite automaton / Lexical analysis / Powerset construction / Deterministic finite automaton / Regular expression / Finite-state machine / Formal language / Regular language / Automata theory / Programming language implementation / Theoretical computer science

Microsoft Word - 03-Lexical-Analysis.doc

Add to Reading List

Source URL: dragonbook.stanford.edu

Language: English - Date: 2008-09-08 16:58:22
89Applied mathematics / Ω-automaton / Algorithm / Tree automaton / Finite-state machine / Automata theory / Theoretical computer science / Computer science

Synthesizing Structured Reactive Programs via Deterministic Tree Automata Benedikt Br¨utsch RWTH Aachen University, Lehrstuhl f¨ur Informatik 7, Germany [removed]

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2013-05-15 08:25:21
90Automata theory / Models of computation / Logic in computer science / Formal methods / Computability theory / Satisfiability Modulo Theories / Lookup table / Deterministic finite automaton / Decision problem / Theoretical computer science / Applied mathematics / Mathematics

Learning Universally Quantified Invariants of Linear Data Structures Pranav Garg1 , Christof L¨oding2 , P. Madhusudan1 , and Daniel Neider2 1 University of Illinois at Urbana-Champaign

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2013-08-07 05:31:08
UPDATE